An Enhanced Approach To Network Reliability Using Boolean Algebra

نویسنده

  • Alexandru Octavian Balan
چکیده

1 Abstract The network reliability analysis problem consists of evaluating a measure of the reliability of a network. A more general context than the network reliability analysis is the stochastic coherent binary system (SCBS) analysis. One approach used in determining the reliability of a system involves Boolean algebra, and in particular a sum of disjoint products (SDP) technique. This paper introduces generalized sum of disjoint products (GSDP), a generalized version of SDP, and evaluates the benefits of such a technique. A GSDP-based algorithm is presented and a comparison is provided between an existing SDP technique and GSDP.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Algorithm for Network Reliability Evaluation

Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...

متن کامل

Modeling reliability in propositions using computer algebra techniques

We present an algebraic method designed to deal with with reliability in propositional logic. Our approach may be regarded as an extension of classical bivalued propositional logics, in which each propositional formula is assigned a certain degree of unreliability. According to this approach, each formula will be used in the context of reasoning depending on how much reliability it is associate...

متن کامل

On some classes of expansions of ideals in $MV$-algebras

In this paper, we introduce the notions of expansion of ideals in $MV$-algebras, $ (tau,sigma)- $primary, $ (tau,sigma)$-obstinate  and $ (tau,sigma)$-Boolean  in $ MV- $algebras. We investigate the relations of them. For example, we show that every $ (tau,sigma)$-obstinate ideal of an $ MV-$ algebra is $ (tau,sigma)$-primary  and $ (tau,sigma)$-Boolean. In particular, we define an expansion $ ...

متن کامل

Omega-almost Boolean rings

In this paper the concept of an $Omega$- Almost Boolean ring is introduced and illistrated how a sheaf of algebras can be constructed from an $Omega$- Almost Boolean ring over a locally Boolean space.

متن کامل

An Enhanced HL-RF Method for the Computation of Structural Failure Probability Based On Relaxed Approach

The computation of structural failure probability is vital importance in the reliability analysis and may be carried out on the basis of the first-order reliability method using various mathematical iterative approaches such as Hasofer-Lind and Rackwitz-Fiessler (HL-RF). This method may not converge in complicated problems and nonlinear limit state functions, which usually shows itself in the f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005